Convergence and Applications of a Gossip-Based Gauss-Newton Algorithm
نویسندگان
چکیده
منابع مشابه
Convergence of a Short-step Primal-dual Algorithm Based on the Gauss-newton Direction
We prove the theoretical convergence of a short-step, approximate pathfollowing, interior-point primal-dual algorithm for semidefinite programs based on the Gauss-Newton direction obtained from minimizing the norm of the perturbed optimality conditions. This is the first proof of convergence for the Gauss-Newton direction in this context. It assumes strict complementarity and uniqueness of the ...
متن کاملConvergence and Application of a Modified Iteratively Regularized Gauss-Newton Algorithm
We establish theoretical convergence results for an Iteratively Regularized Gauss Newton (IRGN) algorithm with a specific Tikhonov regularization. This Tikhnov regularization, which uses a seminorm generated by a linear operator, is motivated by mapping of the minimization variables to physical space which exposes the different scales of the parameters and therefore also suggests appropriate we...
متن کاملConvergence analysis of a proximal Gauss-Newton method
An extension of the Gauss-Newton algorithm is proposed to find local minimizers of penalized nonlinear least squares problems, under generalized Lipschitz assumptions. Convergence results of local type are obtained, as well as an estimate of the radius of the convergence ball. Some applications for solving constrained nonlinear equations are discussed and the numerical performance of the method...
متن کاملGGRA: a grouped gossip-based reputation aggregation algorithm
An important issue in P2P networks is the existence of malicious nodes that decreases the performance of such networks. Reputation system in which nodes are ranked based on their behavior, is one of the proposed solutions to detect and isolate malicious (low ranked) nodes. Gossip Trust is an interesting previously proposed algorithm for reputation aggregation in P2P networks based on t...
متن کاملConvergence rates of the continuous regularized Gauss—Newton method
In this paper a convergence proof is given for the continuous analog of the Gauss—Newton method for nonlinear ill-posed operator equations and convergence rates are obtained. Convergence for exact data is proved for nonmonotone operators under weaker source conditions than before. Moreover, nonlinear ill-posed problems with noisy data are considered and a priori and a posteriori stopping rules ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2013
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2013.2276440